Extended modules
نویسندگان
چکیده
منابع مشابه
Extended Modules
Suppose R and S are local rings and (R,m) → (S,n) is a flat local homomorphism. Given a finitely generated S-module N , we say N is extended (from R) provided there is an R-module M such that S ⊗R M is isomorphic to N as an S-module. If such a module M exists, it is unique up to isomorphism (cf. [EGA, (2.5.8)], and it is necessarily finitely generated. The m-adic completion R → R̂ and the Hensel...
متن کاملReconciling Inconsistencies Between Package-extended Ontology Modules
Construction of ontologies in specific domains (e.g., molecular biology, electronic commerce), is invariably a collaborative activity that requires incorporation of independently generated ontology fragments or ontology modules, and hence reconciliation of inconsistencies among ontology modules. We investigate an approch to reconciling the inconsistencies among ontologies using defeasible axiom...
متن کاملExtended Degree Functions and Monomial Modules
The arithmetic degree, the smallest extended degree, and the homological degree are invariants that have been proposed as alternatives of the degree of a module if this module is not Cohen-Macaulay. We compare these degree functions and study their behavior when passing to the generic initial or the lexicographic submodule. This leads to various bounds and to counterexamples to a conjecture of ...
متن کاملVerification of Unloadable C Modules ( Extended
Programs in unsafe languages, like C and C++, may dynamically load and unload modules. For example, some operating system kernels support dynamic loading and unloading of device drivers. This causes specific difficulties in the verification of such programs and modules; in particular, it must be verified that no functions or global variables from the module are used after the module is unloaded...
متن کاملMixin modules, modules and extended value binding in a call-by-value setting
ion. Indeed, an expression supposed to be of an abstract type t evaluates to a value of its implementation type, say int for example. The equational theory of types does not contain the equality t = int , and therefore reduction does not preserve types does not hold. For DS , soundness is proved in a non-standard way. First, a new type system is defined, as the initial one, but without type abs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Commutative Algebra
سال: 2009
ISSN: 1939-2346
DOI: 10.1216/jca-2009-1-3-481